Code reordering on limited branch offset
نویسندگان
چکیده
منابع مشابه
Instruction Reordering for Code Compression
Runtime executable code compression is a method which uses standard data compression methods and binary machine code transformations to achieve smaller file size, yet maintaining the ability to execute the compressed file as a regular executable. With a disassembler, an almost perfect instructional and functional level disassembly can be generated. Using the structural information of the compil...
متن کاملAccurate simulation and evaluation of code reordering
The need for bridging the ever growing gap between memory and processor performance has motivated research for exploiting the memory hierarchy effectively. An important software solution called code reordering produces a new program layout to better utilize the available memory hierarchy. Many algorithms have been proposed. They differ based on: 1) the code granularity assumed by reordering alg...
متن کاملCode Reordering for Multi-level Cache Hierarchies
As the gap between memory and processor performance continues to grow, it becomes increasingly important to exploit cache memory eeectively. Both hardware and software techniques can be used to better utilize the cache. Many software solutions produce new programs layouts to better utilize the available memory and cache address space. In this paper we present a new link-time code reordering alg...
متن کاملA Reordering Technique for E cient Code Motion
Emerging design problems are prompting the use of code motion and speculative execution in high-level synthesis to shorten schedules and meet tight timeconstraints. However, some code motions are not worth doing from a worst-case execution perspective. We propose a technique that selects the most promising code motions, thereby increasing the density of optimal solutions in the search space.
متن کاملA Code Reordering Transformation for Improved Cache Performance
We prove theorems that show that if we can reorder a program's memory reference stream such that the reordered memory reference stream satis es a disjointness property, then the transformed program corresponding to the reordered stream is guaranteed to have fewer misses for any cache with arbitrary size or organization so long as the cache uses the LRU replacement policy. We can apply these res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Architecture and Code Optimization
سال: 2007
ISSN: 1544-3566,1544-3973
DOI: 10.1145/1250727.1250730